package Tree;

public interface BinaryTTree<T extends Comparable<? super T>>{
    boolean isEmpty();
    void insert(T x);
    BinaryNode<T> insert(BinaryNode<T> p,boolean left,T x);
    void clear();
    void preorder();
    void inorder();
    void postorder();
    void levelorder();
    int size();
    int height();
    BinaryNode<T> search(T key);
    int level(T key);
    BinaryNode<T> remove(T key);
}
